<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    107. Binary Tree Level Order Traversal II
   </h1>
   <p>
    Given a binary tree, return the
    <i>
     bottom-up level order
    </i>
    traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
   </p>
   <p>
    For example:
    <br>
    Given binary tree
    <code>
     [3,9,20,null,null,15,7]
    </code>
    ,
    <br>
   </p>
   <pre>
    3
   / \
  9  20
    /  \
   15   7
</pre>
   <p>
    return its bottom-up level order traversal as:
    <br>
   </p>
   <pre>
[
  [15,7],
  [9,20],
  [3]
]
</pre>
  </div>
  <div>
   <h1 class="question_title">
    107. 二叉树的层次遍历 II
   </h1>
   <p>
    给定一个二叉树，返回其节点值自底向上的层次遍历。 （即按从叶子节点所在层到根节点所在的层，逐层从左向右遍历）
   </p>
   <p>
    例如：
    <br>
    给定二叉树
    <code>
     [3,9,20,null,null,15,7]
    </code>
    ,
   </p>
   <pre>    3
   / \
  9  20
    /  \
   15   7
</pre>
   <p>
    返回其自底向上的层次遍历为：
   </p>
   <pre>[
  [15,7],
  [9,20],
  [3]
]
</pre>
  </div>
 </body>
</html>